An improved multiclass LogitBoost using adaptive-one-vs-one
نویسندگان
چکیده
منابع مشابه
AOSO-LogitBoost: Adaptive One-Vs-One LogitBoost for Multi-Class Problem
This paper presents an improvement to model learning when using multi-class LogitBoost for classification. Motivated by the statistical view, LogitBoost can be seen as additive tree regression. Two important factors in this setting are: 1) coupled classifier output due to a sum-to-zero constraint, and 2) the dense Hessian matrices that arise when computing tree node split gain and node value fi...
متن کاملRobust LogitBoost and Adaptive Base Class (ABC) LogitBoost
Logitboost is an influential boosting algorithm for classification. In this paper, we develop robust logitboost to provide an explicit formulation of tree-split criterion for building weak learners (regression trees) for logitboost. This formulation leads to a numerically stable implementation of logitboost. We then propose abc-logitboost for multi-class classification, by combining robust logi...
متن کاملA Simple Cost-sensitive Multiclass Classification Algorithm Using One-versus-one Comparisons
Many real-world applications require varying costs for different types of misclassification errors. Such a cost-sensitive classification setup can be very different from the regular classification one, especially in the multiclass case. Thus, traditional meta-algorithms for regular multiclass classification, such as the popular one-versus-one approach, may not always work well under the cost-se...
متن کاملImage Classification Using SVMs: One-against-One Vs One-against-All
Support Vector Machines (SVMs) are a relatively new supervised classification technique to the land cover mapping community. They have their roots in Statistical Learning Theory and have gained prominence because they are robust, accurate and are effective even when using a small training sample. By their nature SVMs are essentially binary classifiers, however, they can be adopted to handle the...
متن کاملMulticlass Learning at One-class Complexity
We show in this paper the multiclass classification problem can be implemented in the maximum margin framework with the complexity of one binary Support Vector Machine. We show reducing the complexity does not involve diminishing performance but in some cases this approach can improve the classification accuracy. The multiclass classification is realized in the framework where the output labels...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Machine Learning
سال: 2014
ISSN: 0885-6125,1573-0565
DOI: 10.1007/s10994-014-5434-3